heuristic search

Terms from Artificial Intelligence: humans at the heart of algorithms

Page numbers are for draft copy at present; they will be replaced with correct numbers when final book is formatted. Chapter numbers are correct and will not change now.

Heuristic search uses some form of heuristics to guide which areas of the search space to explore first. This is particularly important in very large search spaces (e.g. board positions in Go), or even infinite ones Best-first search is the simplest example of a heuristic search ordering the items in the open list based on a heurustic evaluation.

Used in Chap. 4: pages 53, 61; Chap. 15: page 241

Also known as heuristic